A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path

نویسندگان

چکیده

Abstract The distribution/allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it impossible to solve a in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for large-term operation whole supply chain. These provide near optimal solutions particularly large-scale test problems. This paper presents an integrated chain model which flexible delivery path. As solution methodology, we apply memetic algorithm neighborhood search mechanism and novelty population presentation method called “extended random path direct encoding method.” To illustrate performance proposed algorithm, LINGO optimization software serves comparison basis small size large-size cases that are dealing real world, classical genetic second metaheuristic considered compare results show efficiency algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm

Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...

متن کامل

a flexible integrated forward/ reverse logistics model with random path-based memetic algorithm

due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. the significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. this paper proposes a flexible mixed-integer programming model to ...

متن کامل

A Memetic Algorithm for Hybrid Flowshops with Flexible Machine Availability Constraints

This paper considers the problem of scheduling hybrid flowshops with machine availability constraints (MAC) to minimize makespan. The paper deals with a specific case of MAC caused by preventive maintenance (PM) operations. Contrary to previous papers considering fixed or/and conservative policies, we explore a case in which PM activities might be postponed or expedited while necessary. Regardi...

متن کامل

A memetic algorithm for bi-objective integrated forward/reverse logistics network design

Logistics network design is a major strategic issue due to its impact on the efficiency and responsiveness of the supply chain. This paper proposes a model for integrated logistics network design to avoid the sub-optimality caused by a separate, sequential design of forward and reverse logistics networks. First, a bi-objective mixed integer programming formulation is developed to minimize the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Forum

سال: 2021

ISSN: ['2662-2556']

DOI: https://doi.org/10.1007/s43069-021-00087-8